Degrees of Exclusivity in Disjunctive Databases

نویسندگان

  • Navin Viswanath
  • Rajshekhar Sunderraman
چکیده

Ever since the emergence of the relational database model, the problem of incompleteness has been studied extensively. Declarative semantics for disjunctive databases widely adopt two methodologies representing opposite ends of the spectrum Minker’s GCWA interprets disjunctions exclusively while Ross and Topor’s DDR interprets them inclusively. We argue that the use of either one as the semantics is limiting. For example, in a blood group relation, saying that the blood group of John is A or B, BG(John, A) ∨ BG(John, B) can be interpreted exclusively while the statement supplier S1 supplies part P1 or P2 to project J1, supplies(S1, P1, J1) ∨ supplies(S1, P2, J1) need not necessarily be exclusive. In this paper, we present a model that allows the nature of the disjunctions to be represented explicitly and show its relation to other semantics for disjunctive databases. A notable feature of this extension is that it does not require variables in order to represent indefinite information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tractable Class of Disjunctive Deductive Databases

In general, computing answers to queries in disjunctive deductive databases is CoNP-complete and therefore computationally infeasible. However, there are some tractable classes of disjunctive databases. In this paper, we present polynomial time algorithms to compute answers to queries in one such tractable class of disjunctive databases where at most two atoms are allowed in any disjunction.

متن کامل

Aggregation in Disjunctive Deductive Databases

Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...

متن کامل

Deductive Databases with Conditional Facts

Department of Computer Science The Wichita State University Wichita, Kansas 67260-0083, USA e-mail: [email protected] Abstract. We introduce the notion of conditional facts in deductive databases. The language used to express the conditions in the basic facts does not involve constructs used to describe the database and is motivated by its potential usefulness in expressing disjunctive facts and ...

متن کامل

Possible Model Semantics for Disjunctive Databases

This paper presents a novel approach to the semantics of deductive databases. The possible model semantics is introduced as an alternative approach to the classical minimal model semantics. The possible model semantics can distinguish both inclusive and exclusive disjunctions, and provide a exible mechanism for inferring negation in disjunctive databases. The possible model semantics is charact...

متن کامل

Disjunctive Deductive Databases

Background material is presented on deductive and normal de-ductive databases. A historical review is presented of work in disjunctive deductive databases, starting from 1982. The semantics of alternative classes of disjunctive databases is reviewed with their model and xpoint characterizations. Algorithms are developed to compute answers to queries in the alternative theories using the concept...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008